A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions
Identifieur interne : 001676 ( Main/Exploration ); précédent : 001675; suivant : 001677A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions
Auteurs : Tobias Nipkow [Allemagne] ; Maximilian Haslbeck [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We survey a number of decision procedures for the equivalence of regular expressions that have been formalised with the help of interactive proof assistant over the past few years.
Url:
DOI: 10.1007/978-3-642-40537-2_3
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003612
- to stream Istex, to step Curation: 003570
- to stream Istex, to step Checkpoint: 000302
- to stream Main, to step Merge: 001688
- to stream Main, to step Curation: 001676
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions</title><author><name sortKey="Nipkow, Tobias" sort="Nipkow, Tobias" uniqKey="Nipkow T" first="Tobias" last="Nipkow">Tobias Nipkow</name></author><author><name sortKey="Haslbeck, Maximilian" sort="Haslbeck, Maximilian" uniqKey="Haslbeck M" first="Maximilian" last="Haslbeck">Maximilian Haslbeck</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E23C49D882ECF1D2F760FE28D51DE393C32FF126</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40537-2_3</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-G8CG4KFF-K/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003612</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003612</idno><idno type="wicri:Area/Istex/Curation">003570</idno><idno type="wicri:Area/Istex/Checkpoint">000302</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000302</idno><idno type="wicri:doubleKey">0302-9743:2013:Nipkow T:a:brief:survey</idno><idno type="wicri:Area/Main/Merge">001688</idno><idno type="wicri:Area/Main/Curation">001676</idno><idno type="wicri:Area/Main/Exploration">001676</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions</title><author><name sortKey="Nipkow, Tobias" sort="Nipkow, Tobias" uniqKey="Nipkow T" first="Tobias" last="Nipkow">Tobias Nipkow</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institut für Informatik, Technische Universität München</wicri:regionArea><placeName><settlement type="city">Munich</settlement><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region></placeName><orgName type="university">Université technique de Munich</orgName></affiliation></author><author><name sortKey="Haslbeck, Maximilian" sort="Haslbeck, Maximilian" uniqKey="Haslbeck M" first="Maximilian" last="Haslbeck">Maximilian Haslbeck</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institut für Informatik, Technische Universität München</wicri:regionArea><placeName><settlement type="city">Munich</settlement><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region></placeName><orgName type="university">Université technique de Munich</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We survey a number of decision procedures for the equivalence of regular expressions that have been formalised with the help of interactive proof assistant over the past few years.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Bavière</li><li>District de Haute-Bavière</li></region><settlement><li>Munich</li></settlement><orgName><li>Université technique de Munich</li></orgName></list><tree><country name="Allemagne"><region name="Bavière"><name sortKey="Nipkow, Tobias" sort="Nipkow, Tobias" uniqKey="Nipkow T" first="Tobias" last="Nipkow">Tobias Nipkow</name></region><name sortKey="Haslbeck, Maximilian" sort="Haslbeck, Maximilian" uniqKey="Haslbeck M" first="Maximilian" last="Haslbeck">Maximilian Haslbeck</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001676 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001676 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:E23C49D882ECF1D2F760FE28D51DE393C32FF126
|texte= A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions
}}
| This area was generated with Dilib version V0.6.33. |  |